منابع مشابه
Some remarks on Betti numbers of random polygon spaces
Polygon spaces such as M = {(u1, . . . , un) ∈ S1 × . . . S1,∑ni=1 liui = 0}/SO(2), or the three-dimensional analogs N play an important rôle in geometry and topology, and are also of interest in robotics where the li model the lengths of robot arms. When n is large, one can assume that each li is a positive real valued random variable, leading to a randommanifold. The complexity of such manifo...
متن کاملConvex Polygon Intersection Graphs
Geometric intersection graphs are graphs determined by the intersections of certain geometric objects. We study the complexity of visualizing an arrangement of objects that induces a given intersection graph. We give a general framework for describing classes of geometric intersection graphs, using arbitrary finite base sets of rationally given convex polygons and rationally-constrained affine ...
متن کاملNew results of intersection numbers on moduli spaces of curves.
We present a series of results we obtained recently about the intersection numbers of tautological classes on moduli spaces of curves, including a simple formula of the n-point functions for Witten's tau classes, an effective recursion formula to compute higher Weil-Petersson volumes, several new recursion formulae of intersection numbers and our proof of a conjecture of Itzykson and Zuber conc...
متن کاملCalculating intersection numbers on moduli spaces of pointed curves
The purpose of this note is to explain how to calculate intersection numbers on moduli spaces of curves. More specifically, we will discuss computing intersection numbers among tautological classes on the moduli space of stable n-pointed curves of genus g, denoted Mg,n. The recipe described below is the cumulation of many results found in various papers [AC,F2,GP,M,W], but is reformulated here ...
متن کاملGuaranteed intersection-free polygon morphing
We present a method for naturally and continuously morphing two simple planar polygons with corresponding vertices in a manner that guarantees that the intermediate polygons are also simple. This contrasts with all existing polygon morphing schemes who cannot guarantee the non-self-intersection property on a global scale, due to the heuristics they employ. Our method achieves this property by r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the American Mathematical Society
سال: 2009
ISSN: 0002-9947
DOI: 10.1090/s0002-9947-09-04796-5